FIAT 1969

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fiat lux

Just as engineers learnt to harness the power of electrons in transistors and microchips—which revolutionized modern society—physicists and biologists are now learning how to tame photons. Their work is generating exciting new possibilities for optical microscopy, with a resolution and level of detail hitherto undreamt of. Biophotonics is a new and exciting research field that is already delive...

متن کامل

Fiat Objects

When, in 1784, the land surveyor Thomas Jefferson called into being the states of the so-called Northwest Ordinance by drawing lines on a map, his map was sufficiently inaccurate that it did not even have the Great Lakes in the right places. Ten states would nonetheless eventually be created in the area of Jefferson’s map, having boundaries which in large degree follow his original lines. These...

متن کامل

Multidisciplinarity: by fiat or need?

Multidisciplinarity: by fiat or need? Stressing the need for more multidisciplinary approaches to tackle scientific problems is always a safe position to take during discussions on the future of the biological sciences. The common belief that interesting things are happening at the boundaries of different research fields is of course true. But interesting things also happen right at the core of...

متن کامل

A Fiat-Shamir Implementation Note

In the Micali-Shamir paper [7] improving the efficiency of the original Fiat-Shamir protocol [5,6,9], the authors state that “(. . .) not all of the vi’s will be quadratic residues mod n. We overcome this technical difficulty with an appropriate perturbation technique (. . .)” This perturbation technique is made more explicit in the associated patent application [8]: “Each entity is allowed to ...

متن کامل

Competitive Paging Algorithms AMOS FIAT

The paging problem is that of deciding which pages to keep in a memory of k pages in order to minimize the number of page faults. We develop the marking algorithm, a randomized on-line algorithm for the paging problem. We prove that its expected cost on any sequence of requests is within a factor of 2Hk of optimum. (Where Hk is the kth harmonic number, which is roughly Ink.) The best such facto...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Kurasje

سال: 1970

ISSN: 0455-0641,0455-0641

DOI: 10.22439/kur2-319703608